Compact Propositional Gödel Logics
نویسندگان
چکیده
Entailment in propositional Gödel logics can be defined in a natural way. While all infinite sets of truth values yield the same sets of tautologies, the entailment relations differ. It is shown that there is a rich structure of infinite-valued Gödel logics, only one of which is compact. It is also shown that the compact infinite-valued Gödel logic is the only one which interpolates, and the only one with an r.e. entailment relation.
منابع مشابه
Truth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملHypersequent Calculi for Gödel Logics - a Survey
Hypersequent calculi arise by generalizing standard sequent calculi to refer to whole contexts of sequents instead of single sequents. We present a number of results using hypersequents to obtain a Gentzen-style characterization for the family of Gödel logics. We first describe analytic calculi for propositional finite and infinite-valued Gödel logics. We then show that the framework of hyperse...
متن کاملA Guide to Quantified Propositional Gödel Logic
Gödel logic is a non-classical logic which naturally turns up in a number of different areas within logic and computer science. By choosing subsets of the unit interval [0, 1] as the underlying set of truthvalues many different Gödel logics have been defined. Unlike in classical logic, adding propositional quantifiers to Gödel logics in many cases increases the expressive power of the logic, an...
متن کاملSequent of Relations Calculi: A Framework for Analytic Deduction in Many-Valued Logics
We present a general framework that allows to construct systematically analytic calculi for a large family of (propositional) many-valued logics — called projective logics — characterized by a special format of their semantics. All finite-valued logics as well as infinite-valued Gödel logic are projective. As a case-study, sequent of relations calculi for Gödel logics are derived. A comparison ...
متن کاملGödel logics with an operator shifting truth values
We consider GÃűdel logics extended by an operator whose semantics is given by I(o(A)) = min{1, r + I(A)}. The language of propositional GÃűdel logics L consists of a countably infinite set Var of propositional variables and the connectives ⊥, ⊃, ∧, ∨ with their usual arities. We will consider extensions by a unary connective o, by a unary connective 4 or by both. For any r ∈ [0, 1], a GÃűdel r-...
متن کامل